Hub covering location problems with different coverage types
نویسندگان
چکیده
منابع مشابه
Hub Covering Location Problem Considering Queuing and Capacity Constraints
In this paper, a hub covering location problem is considered. Hubs, which are the most congested part of a network, are modeled as M/M/C queuing system and located in placeswhere the entrance flows are more than a predetermined value.A fuzzy constraint is considered in order to limit the transportation time between all origin-destination pairs in the network.On modeling, a nonlinear mathematica...
متن کاملHub Location Problems with Allocation Constraints
Hub location problems, with the hub-and-spoke network structure, involve locating hub facilities, allocating the non-hubs (spokes) to the hubs, and determining the path for each origin-destination pair. In a pure hub-and-spoke network, all hubs, which act as intermediate switching or transshipment points for internodal flows, are fully interconnected and none of the non-hubs are directly connec...
متن کاملDynamic Hub Covering Problem with Flexible Covering Radius
Abstract One of the basic assumptions in hub covering problems is considering the covering radius as an exogenous parameter which cannot be controlled by the decision maker. Practically and in many real world cases with a negligible increase in costs, to increase the covering radii, it is possible to save the costs of establishing additional hub nodes. Change in problem parameters during the pl...
متن کاملCapacitated Single-Assignment Hub Covering Location Problem under Fuzzy Environment
This paper studies capacitated single-allocation hub covering location problem with fuzzy cover radius and travel time. Objective of hub covering problem is to find the minimum number of hubs considering the maximum allowable travel time. Computational results show that due to uncertainty, number of hubs and the allocation of non-hub nodes to hub nodes are changed. This paper proposes heuristic...
متن کاملHub Covering Location Problem under Gradual Decay Function
This paper developed a mathematical model framework using the single allocation strategy for hub covering location problem. The model encompassed the transportation time covering under gradual decay function. Within a certain transportation time for the origin and destination nodes among two hubs, the route is fully covered, and beyond another specified transportation time the route is not cove...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientia Iranica
سال: 2011
ISSN: 1026-3098
DOI: 10.1016/j.scient.2011.09.018